Decidability and undecidability theorems for PAC-fields
نویسندگان
چکیده
منابع مشابه
Decidability and Undecidability Theorems for Pac-fields
A pseudo-algebraically closed field (PAC-field for short) is a field K such that every absolutely irreducible variety defined over K has ̂ -rational points. In [Ax] Ax gave a decision method for the (elementary) theory of finite fields, the basis of which was his characterization of the infinite models of that theory as the perfect PAC-fields K with G(K) = Z. (Here and in the following we use th...
متن کاملDecidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over intervals parameterized by arithmetic variables (e.g., ∧n i=1 pi, where n is a parameter). The satisfiability problem is shown to be undecidable for this new logic, but we introduce a very general class of schemata, called b...
متن کاملGame Theoretic Decidability and Undecidability∗
We study the possibility of prediction/decision making in a finite 2—person game with pure strategies, following the Nash(-Johansen) noncooperative solution theory. We adopt the epistemic logic KD as the base logic to capture individual decision making from the viewpoint of logical inference. Since some infinite regresses naturally arise in this theory, we use a fixed-point extension EIR of KD ...
متن کاملTechniques for Decidability and Undecidability of Bisimilarity
In this tutorial we describe general approaches to deciding bisimilarity between vertices of (infinite) directed edge-labelled graphs. The approaches are based on a systematic search following the definition of bisimilarity. We outline (in decreasing levels of detail) how the search is modified to solve the problem for finite graphs, BPP graphs, BPA graphs, normed PA graphs, and normed PDA grap...
متن کاملDecidability and Undecidability in Probability Logic
We study computational aspects of a probabilistic logic based on a well-known model of induction by Valiant. We prove that for this paraconsistent logic the set of valid formulas is undecidable.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1981
ISSN: 0273-0979
DOI: 10.1090/s0273-0979-1981-14872-2